<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<site>sibgrapi.sid.inpe.br 802</site>
		<holdercode>{ibi 8JMKD3MGPEW34M/46T9EHH}</holdercode>
		<identifier>6qtX3pFwXQZeBBx/vRoVU</identifier>
		<repository>sid.inpe.br/banon/2002/10.23.12.36</repository>
		<lastupdate>2002:08.30.03.00.00 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatarepository>sid.inpe.br/banon/2002/10.23.12.36.24</metadatarepository>
		<metadatalastupdate>2022:06.14.00.11.46 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 2002}</metadatalastupdate>
		<doi>10.1109/SIBGRA.2002.1167122</doi>
		<citationkey>BatageloWu:2002:DyScOc</citationkey>
		<title>Dynamic scene occlusion culling using a regular grid</title>
		<year>2002</year>
		<numberoffiles>1</numberoffiles>
		<size>266 KiB</size>
		<author>Batagelo, Harlen Costa,</author>
		<author>Wu, Shin-Ting,</author>
		<editor>Gonçalves, Luiz Marcos Garcia,</editor>
		<editor>Musse, Soraia Raupp,</editor>
		<editor>Comba, João Luiz Dihl,</editor>
		<editor>Giraldi, Gilson,</editor>
		<editor>Dreux, Marcelo,</editor>
		<conferencename>Brazilian Symposium on Computer Graphics and Image Processing, 15 (SIBGRAPI)</conferencename>
		<conferencelocation>Fortaleza, CE, Brazil</conferencelocation>
		<date>10-10 Oct. 2002</date>
		<publisher>IEEE Computer Society</publisher>
		<publisheraddress>Los Alamitos</publisheraddress>
		<booktitle>Proceedings</booktitle>
		<tertiarytype>Full Paper</tertiarytype>
		<organization>SBC - Brazilian Computer Society</organization>
		<transferableflag>1</transferableflag>
		<versiontype>finaldraft</versiontype>
		<abstract>We present an output-sensitive occlusion culling algorithm for densely occluded dynamic scenes where both the viewpoint and objects move arbitrarily. Our method works on a regular grid that represents a volumetric discretization of the space and uses the opaque regions of the scene as virtual occluders. We introduce new techniques of efficient traversal of voxels, object discretization and occlusion computation that strength the benefits of using regular grids in dynamic scenes. The method also exploits temporal coherence and realizes occluder fusion inobject-space. For each frame, the algorithm computes a conservative set of visible objects that greatly accelerates the visualization of complex dynamic scenes. We discuss the results of a 2D and 3D case implementation.</abstract>
		<language>en</language>
		<targetfile>52.pdf</targetfile>
		<usergroup>administrator</usergroup>
		<visibility>shown</visibility>
		<nexthigherunit>8JMKD3MGPEW34M/46QCSHP</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/4742MCS</nexthigherunit>
		<citingitemlist>sid.inpe.br/sibgrapi/2022/05.01.04.11 6</citingitemlist>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<notes>The conference was held in Fortaleza, CE, Brazil, from October 7 to 10.</notes>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/banon/2002/10.23.12.36</url>
	</metadata>
</metadatalist>